34,543 research outputs found

    Collective atomic recoil motion in short-pulse multi-matter-optical wave mixing

    Full text link
    An analytical perturbation theory of short-pulse, matter-wave superradiant scatterings is presented. We show that Bragg resonant enhancement is incapacitated and both positive and negative order scatterings contribute equally. We further show that propagation gain is small and scattering events primarily occur at the end of the condensate where the generated field has maximum strength, thereby explaining the apparent ``asymmetry" in the scattered components with respect to the condensate center. In addition, the generated field travels near the speed of light in a vacuum, resulting in significant spontaneous emission when the one-photon detuning is not sufficiently large. Finally, we show that when the excitation rate increases, the generated-field front-edge-steepening and peak forward-shifting effects are due to depletion of the ground state matter wave.Comment: This manuscript was submitted for publication in Nov., 200

    Computing the Least-core and Nucleolus for Threshold Cardinality Matching Games

    Full text link
    Cooperative games provide a framework for fair and stable profit allocation in multi-agent systems. \emph{Core}, \emph{least-core} and \emph{nucleolus} are such solution concepts that characterize stability of cooperation. In this paper, we study the algorithmic issues on the least-core and nucleolus of threshold cardinality matching games (TCMG). A TCMG is defined on a graph G=(V,E)G=(V,E) and a threshold TT, in which the player set is VV and the profit of a coalition S⊆VS\subseteq V is 1 if the size of a maximum matching in G[S]G[S] meets or exceeds TT, and 0 otherwise. We first show that for a TCMG, the problems of computing least-core value, finding and verifying least-core payoff are all polynomial time solvable. We also provide a general characterization of the least core for a large class of TCMG. Next, based on Gallai-Edmonds Decomposition in matching theory, we give a concise formulation of the nucleolus for a typical case of TCMG which the threshold TT equals 11. When the threshold TT is relevant to the input size, we prove that the nucleolus can be obtained in polynomial time in bipartite graphs and graphs with a perfect matching

    Period halving of Persistent Currents in Mesoscopic Mobius ladders

    Full text link
    We investigate the period halving of persistent currents(PCs) of non-interacting electrons in isolated mesoscopic M\"{o}bius ladders without disorder, pierced by Aharonov-Bhom flux. The mechanisms of the period halving effect depend on the parity of the number of electrons as well as on the interchain hopping. Although the data of PCs in mesoscopic systems are sample-specific, some simple rules are found in the canonical ensemble average, such as all the odd harmonics of the PCs disappear, and the signals of even harmonics are non-negative. {PACS number(s): 73.23.Ra, 73.23.-b, 68.65.-k}Comment: 6 Pages with 3 EPS figure

    Single-cluster dynamics for the random-cluster model

    Full text link
    We formulate a single-cluster Monte Carlo algorithm for the simulation of the random-cluster model. This algorithm is a generalization of the Wolff single-cluster method for the qq-state Potts model to non-integer values q>1q>1. Its results for static quantities are in a satisfactory agreement with those of the existing Swendsen-Wang-Chayes-Machta (SWCM) algorithm, which involves a full cluster decomposition of random-cluster configurations. We explore the critical dynamics of this algorithm for several two-dimensional Potts and random-cluster models. For integer qq, the single-cluster algorithm can be reduced to the Wolff algorithm, for which case we find that the autocorrelation functions decay almost purely exponentially, with dynamic exponents zexp=0.07(1),0.521(7)z_{\rm exp} =0.07 (1), 0.521 (7), and 1.007(9)1.007 (9) for q=2,3q=2, 3, and 4 respectively. For non-integer qq, the dynamical behavior of the single-cluster algorithm appears to be very dissimilar to that of the SWCM algorithm. For large critical systems, the autocorrelation function displays a range of power-law behavior as a function of time. The dynamic exponents are relatively large. We provide an explanation for this peculiar dynamic behavior.Comment: 7 figures, 4 table
    • …
    corecore